leetcode/100-n/575. 分糖果.md

// import (
//     "fmt"
// )
func distributeCandies(candyType []int) (ret int) {
    ret = 0
    sisterHaveArr := make([]int,0)
    n := len(candyType) / 2
    for _, candyId := range candyType {
        isHave := false
        for _, candyIdx := range sisterHaveArr {
            if candyIdx == candyId {
                isHave = true
                break
            }
        }
        if !isHave {
            ret += 1
            if ret == n {
                return
            }
            sisterHaveArr = append(sisterHaveArr, candyId)
        }
        // fmt.Printf("sisterHaveArr:%+v\n", sisterHaveArr)
    }
    return
}